|
In the mathematical theory of matroids, the rank of a matroid is the maximum size of an independent set in the matroid. The rank of a subset ''S'' of elements of the matroid is, similarly, the maximum size of an independent subset of ''S'', and the rank function of the matroid maps sets of elements to their ranks. The rank function is one of the fundamental concepts of matroid theory via which matroids may be axiomatized. The rank functions of matroids form an important subclass of the submodular set functions, and the rank functions of the matroids defined from certain other types of mathematical object such as undirected graphs, matrices, and field extensions are important within the study of those objects. ==Properties and axiomatization== The rank function of a matroid obeys the following properties. *The value of the rank function is always a non-negative integer. *For any two subsets and of , . That is, the rank is a submodular function. *For any set and element , . From the first of these two inequalities it follows more generally that, if , then . That is, the rank is a monotonic function. These properties may be used as axioms to characterize the rank function of matroids: every integer-valued submodular function on the subsets of a finite set that obeys the inequalities for all and is the rank function of a matroid.〔.〕〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「matroid rank」の詳細全文を読む スポンサード リンク
|